Node numbering in a topological structure interconnection network
نویسندگان
چکیده
منابع مشابه
Topological Properties of Some Interconnection Network Graphs
Interconnection networks play a vital role in parallel computing architectures. We investigate topological properties of some networks proposed for parallel computation, based on their underlying graph models. The vertices of the graph correspond to processors and the edges represent communication links between processors. Parameters such as crossing number and thickness strongly aaect the area...
متن کاملA Unified Theory of Interconnection Network Structure
The relationship between the topology of interconnection networks and their functional properties is examined. Graph theoretical characterizations are derived for delta networks , which have a simple routing scheme, and for bidelta networks, which have the delta property in both directions. Delta networks are shown to have a recursive structure. Bidelta networks are shown to have a unique topol...
متن کاملTopological additive numbering of directed acyclic graphs
We propose to study a problem that arises naturally from both Topological Numbering of Directed Acyclic Graphs, and Additive Coloring (also known as Lucky Labeling). Let D be a digraph and f a labeling of its vertices with positive integers; denote by S(v) the sum of labels over all neighbors of each vertex v. The labeling f is called topological additive numbering if S(u) < S(v) for each arc (...
متن کاملOn Node-to-Node Disjoint Paths in the Star Interconnection Network
We study the problem of finding disjoint paths between two nodes in a star interconnection network. Specifically, we show a simple routing algorithm that finds n − 1 disjoint paths between any two nodes s and t in an n-star in optimal O(n) time such that no path has length more than d(s, t) + 4, where d(s, t) is the shortest path length between s and t. This result matches those obtained earlie...
متن کاملTopological Numbering of Features on a Mesh (CC-88-18)
Assume we are given an nXn binary image containing horizontally convex features; Le., for each feature, each of its row's pixels fann an interval on that row. In this paper we consider the problem of assigning topological numbers to such features; i.e., assign a number to every feature f so that all features to the left of f in the image have a smaller number assigned to them. This problem aris...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Science and Technology
سال: 2009
ISSN: 0974-6846,0974-5645
DOI: 10.17485/ijst/2009/v2i11.14